A Synthesized Algorithm for Interactive Consistency
نویسندگان
چکیده
We revisit the interactive consistency problem introduced by Pease, Shostak and Lamport. We first show that their algorithm does not achieve interactive consistency if faults are transient, even if faults are non-malicious. We then present an algorithm that achieves interactive consistency in presence of nonmalicious, asymmetric and transient faults, but only under an additional guaranteed delayed ack assumption. We discovered our algorithm using an automated synthesis technique that is based on bounded model checking and QBF solving. Our synthesis technique is general and simple, and it is a promising approach for synthesizing distributed algorithms.
منابع مشابه
Interactive Consistency in Quasi-Asynchronous Systems
In order to make a dependable distributed computer system resilient to arbitrary failures of its processors, deterministic interactive consistency algorithms (ICAs) are required. Thus far, in order to guarantee interactive consistency, all ICAs found in the literature require that all correct processors in the system start the algorithm simultaneously. In a distributed system, it is hard to sat...
متن کاملPractical Asynchronous Interactive Consistency
Interactive consistency is the problem in which n nodes, where up to t may be byzantine, each with its own private value, run an algorithm that allows all non-faulty nodes to infer the values of each other node. This problem is relevant to critical applications that rely on the combination of the opinions of multiple peers to provide a service. Examples include monitoring a content source to pr...
متن کاملInteractive Consistency Algorithms based on Voting and Error-correcting Codes
This paper presents a new class of synchronous deterministic non-authenticated algorithms for reaching interactive consistency (Byzantine agreement). The algorithms are based on voting and error-correcting codes and require considerably less data communication than the original algorithm, whereas the number of rounds and the number of modules meet the minimum bounds. These algorithm based on vo...
متن کاملPractical Precomputed Radiance Transfer for Mixed Reality
Mixed Reality and its concept of virtual superimposed on real space interplay invoke such interactive experiences that promote new patterns of believability and presence for cultural heritage applications. The seamless integration of virtual cultural artifacts with ‘real lights’ or images of real scenes, is an important step towards believability and consistency in synthesized MR scenes. That s...
متن کاملInteractive Computational Steering : Conservative Vs Optimistic Steering Approaches
Interactive Computational Steering is the online, interactive allocation and adjustment of system resources and application parameters. Causal consistency is an important feature of interactive steering of distributed computations, as it is often required to maintain the correctness of the computation. However, due to the asynchronous nature of distributed computations, it is difficult to coord...
متن کامل